Theorem Proving in
نویسنده
چکیده
Cancellative abelian monoids encompass abelian groups, but also such ubiquitous structures as the natural numbers or multisets. Both the AC axioms and the cancellation law are diicult for a general purpose theorem prover, as they create many variants of clauses which contain sums. We describe a reened superposition calculus for cancellative abelian monoids which requires neither explicit inferences with the theory clauses nor extended equations or clauses. Strong ordering constraints allow us to restrict to inferences that involve the maximal term of the maximal sum in the maximal literal. Besides, the search space is reduced drastically by variable elimination techniques.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملA fixed point method for proving the stability of ring $(alpha, beta, gamma)$-derivations in $2$-Banach algebras
In this paper, we first present the new concept of $2$-normed algebra. We investigate the structure of this algebra and give some examples. Then we apply a fixed point theorem to prove the stability and hyperstability of $(alpha, beta, gamma)$-derivations in $2$-Banach algebras.
متن کاملA New Common Fixed Point Theorem for Suzuki Type Contractions via Generalized $Psi$-simulation Functions
In this paper, a new stratification of mappings, which is called $Psi$-simulation functions, is introduced to enhance the study of the Suzuki type weak-contractions. Some well-known results in weak-contractions fixed point theory are generalized by our researches. The methods have been appeared in proving the main results are new and different from the usual methods. Some suitable examples ar...
متن کاملModeling of Infinite Divisible Distributions Using Invariant and Equivariant Functions
Basu’s theorem is one of the most elegant results of classical statistics. Succinctly put, the theorem says: if T is a complete sufficient statistic for a family of probability measures, and V is an ancillary statistic, then T and V are independent. A very novel application of Basu’s theorem appears recently in proving the infinite divisibility of certain statistics. In addition ...
متن کاملConstruction of measures of noncompactness of $C^k(Omega)$ and $C^k_0$ and their application to functional integral-differential equations
In this paper, first, we investigate the construction of compact sets of $ C^k$ and $ C_0^k$ by proving ``$C^k, C_0^k-version$" of Arzel`{a}-Ascoli theorem, and then introduce new measures of noncompactness on these spaces. Finally, as an application, we study the existence of entire solutions for a class of the functional integral-differential equations by using Darbo's fixe...
متن کاملTheory Exploration with Theorema
Automated theorem proving is a well established subject in computer science. The advances made in the algorithmic techniques for automated theorem proving are impressive, see the survey paper [Loveland 1996]. Also, automated theorem proving has found various important applications in computer science. For example, Robinson’s resolution proving method launched a whole new programming paradigm, n...
متن کامل